ALIGNING THE ORGANIZATIONAL CULTURE WIYH THE CHALLENGES OF GLOBAL COMPETITION: CASE STUDY AT A PUBLIC SERVICE ORGANIZATION IN INDONESIA

In an effort to begin a teambuilding and organizational development program to meet the challenge of global competition, organizational culture was identified for study

Kompetensi Inti Industri Daerah Kabupaten Majalengka

Dalam rangka membangun daya saing daerah, saat ini Kabupaten Majalengka sedang meningkatkan kemandirian dengan memanfaatkan sumber daya alam lokal yang dimiliki. Karena itu, perlu dilakukan penelitian untuk menentukan komoditas unggulan daerah, kompetensi inti industri daerah, dan rencana aksi serta peta panduan pembangunan daerah berdasarkan kompetensi inti industri yang telah ditetapkan. Hasil penelitian menunjukkan bahwa komoditas unggulan di Kabupaten Majalengka adalah jagung, sedangkan Kompetensi Inti Industri Daerah (KIID) Kabupaten Majalengka adalah kemampuan untuk menghasilkan produk olahan jagung yang berkualitas dan berdaya saing tinggi. Hasil analisis SWOT menunjukkan bahwa kemampuan untuk menghasilkan produk-produk yang terbuat dari jagung dengan kualitas tinggi berada di kuadran III. Artinya, kemampuan yang dimiliki masih lemah, namun sangat berpeluang untuk dikembangkan. Karena itu yang harus dilakukan adalah mengubah strategi yang selama ini dilakukan, agar dapat menangkap peluang yang lebih besar. Selain mengusulkan strategi pengembangan, penelitian ini juga mengusulkan kerangka strategi pengembangan dan rencana aksi, lengkap dengan indikator keberhasilannya. Kata kunci : Analisis SWOT, Kompetensi Inti Industri Daerah, Majalengk

CAPACITATED VEHICLE ROUTING PROBLEM WITH TIME WINDOWS FOR MILK COLLECTION AT KPBS PANGALENGAN

This research aims to solve a real-life problem faced by KPBS, a regional dairy company in Pangalengan Village of West Java that collects raw milk from farmers to the location of Milk Treatment. In the considered problem, a daily plan is needed to determine a heterogeneous fleet of vehicles that depart from a depot (the factory) and must visit a set of farmers for collection operations within given time window. This problem is known as the Capacitated Vehicle Routing Problem with Time Windows (CVRPTW) which is one of the classical areas of study in Operations Research. In this study the problem will be solved using heuristic method. Key words: Milk collection, CVRPTW, Operations Research, Heuristi

INSERTION HEURISTIC FOR THE SINGLE ROW LAYOUT PROBLEM IN FLEXIBLE MANUFACTURING SYSTEMS

An important problem in a Flexible Manufacturing System (FMS) is to obtain a layout of machines such that material handling is the most efficient. Since poor layout would result in more parts spending longer time moving from one machine to another, developing layout for FMS is dealing with the arrangement of machines in the shop floor in order to minimize the total flow of parts in the system. In this paper, a single row layout problem is considered, and a heuristic approach, called the insertion heuristic, to solve the problem is proposed. The proposed approach is tested on benchmark problems available in the literature and the results are presented. Key words: FMS, Single row unequal area layout, Insertion Heuristic

MODEL PERENCANAAN SAFETY STOCK TERINTEGRASI UNTUK SISTEM MANUFAKTUR DENGAN FREKUENSI PENGIRIMAN TINGGI

Safety stock di satu sisi dapat menekan atau menghilangkan ongkos yang terjadi akibat keterlambatan pengiriman produk kepada konsumen (opportunity cost) tetapi di sisi lain akan menimbulkan ongkos persediaan (inventory cost). Pada sistem manufaktur dengan frekuensi pengiriman yang tinggi (frequent delivery manufacturing) dan tingkat permintaan berfluktuasi, keterlambatan pengiriman merupakan permasalahan yang sering ditemui. Penyebabnya antara lain karena ketersediaan material tidak sesuai kebutuhan produksi dan/atau hasil produksi tidak sesuai permintaan konsumen. Untuk mengatasi permasalahan tersebut perlu dilakukan perencanaan yang terintegrasi, mulai dari penentuan kuantitas material yang harus dipesan hingga penentuan kuantitas produk jadi yang harus dibuat. Makalah ini membahas model optimasi perencanaan safety stock untuk material dan produk jadi yang dilakukan secara terintegrasi. Tujuan yang ingin dicapai adalah meminimumkan total ongkos yang terdiri dari ongkos memiliki persediaan dan ongkos akibat keterlambatan pengiriman. Kata kunci : Safety stocks, Frequent delivery manufacturing, Inventory and Opportunity costs

HEURISTIC FOR ASYMMETRIC CAPACITATED VEHICLE ROUTING PROBLEM

The vehicle routing problem (VRP) is commonly defined as the problem of designing optimal delivery or collection routes from one or several depots to a set of geographically scattered customers, under a variety of side conditions. This problem is generally described through a graph, whose arcs represent the road sections and vertices correspond to the depot and customer locations. The arcs (and consequently the corresponding graph) can be directed or undirected, depending on whether they can be traversed in only one direction or in both directions. Since each arc is associated with a cost then if the graph is directed, the cost matrix is asymmetric and the corresponding problem is called asymmetric vehicle routing problem (AVRP). Although the symmetric problems are special cases of the asymmetric ones, the latter were much less studied in the literature. In this paper, a type of problem, called the Asymmetric Capacitated Vehicle Routing Problem (ACVRP) is discussed and a heuristic algorithm is proposed to solve the problem. Keywords: Vehicle Routing, Asymmetric, Capacitated, Heuristi

MODEL HEURISTIK PENENTUAN RUTE KENDARAAN DENGAN BATASAN WAKTU PENGIRIMAN

Penentuan rute kendaraan (Vehicle Routing Problem, VRP) merupakan sub persoalan yang sangat penting dari suatu sistem distribusi, sehingga telah mengundang banyak perhatian peneliti untuk menggali berbagai aspek yang terkait dengan persoalan ini. Pada dasarnya persoalan ini adalah menentukan rute sejumlah kendaraan dengan kapasitas tertentu yang mengangkut suatu komoditas dari satu atau lebih depot ke sejumlah pelanggan dengan tingkat kebutuhan tertentu. Tujuannya adalah agar diperoleh total ongkos atau jarak atau waktu tempuh yang minimum. Pada makalah ini dikemukakan suatu metoda heuristik untuk menyelesaikan persoalan penentuan rute kendaraan untuk kondisi dimana setiap pelanggan menetapkan batas awal dan akhir waktu pengiriman, yang dikenal sebagai Vehicle Routing Problem with Time Window (VRPTW). Penentuan rute ditujukan tidak hanya untuk meminimumkan total ongkos perjalanan tetapi juga total waktu pelanggan menunggu. Besarnya ongkos diasumsikan proporsional terhadap jarak dan waktu tempuh. Kata kunci:: vehicle routing, time window, heuristi

VEHICLE ROUTING IN BEVERAGE INDUSTRY

A classical problem in distribution logistics is the problem of designing least cost routes from one depot to a set of geographically scattered points. All routes start and end at the depot, and the total demands of all points on one particular route must not exceed the capacity of the vehicle. This problem is known as the Vehicle Routing Problem (VRP). If each customer to be served is associated with two quantities of goods to be collected and delivered, the problem is then called the Vehicle Routing Problem with Pick-up and Delivery (VRPPD). In this paper, the Vehicle Routing Problem with Pick-up and Delivery (VRPPD) is used to solve the distribution problem face by a beverage industry where vehicles of a certain loading capacity must routinely visit several retailers. Each retailer has a certain demand of full bottles to be delivered and empty bottles to be picked-up and be brought back to the depot. A heuristic algorithm is then used to construct the routes with the objective of minimizing not only the number of vehicles required, but also the total travel distance (or total cost) incurred by the fleet of vehicles. Keywords: Vehicle Routing Problem, Pick-up and Delivery, Heuristi